Reversible Cellular Automaton Able to Simulate Any Other Reversible One Using Partitioning Automata
نویسنده
چکیده
Partitioning automata (PA) are de ned. They are equivalent to cellular automata (CA). Reversible sub-classes are also equivalent. A simple, reversible and universal partitioning automaton is described. Finally, it is shown that there are reversible PA and CA that are able to simulate any reversible PA or CA on any con guration.
منابع مشابه
Intrinsic Universality of a 1-Dimensional Reversible Cellular Automaton
This paper deals with simulation and reversibility in the context of Cellular Automata (ca). We recall the deenitions of ca and of the Block (bca) and Partitioned (pca) subclasses. We note that pca simulate ca. A simulation of reversible ca (r-ca) with reversible pca is built contradicting the intuition of known undecidability results. We build a 1-r-ca which is intrinsic universal, i.e., able ...
متن کاملConstruction of reversible cellular automata by amalgamations and permutations of states
Cellular automata are discrete dynamical systems characterized by simple local interactions among their components which are able to produce complex global behaviors, reason why they have been used to simulate natural and artificial systems and for implementing new paradigms of unconventional computing [I, 21. A classical study in dynamical systems is to understand reversible properties; in cel...
متن کاملRepresenting Reversible Cellular Automata with Reversible Block Cellular Automata
Cellular automata are mappings over infinite lattices such that each cell is updated according to the states around it and a unique local function. Block permutations are mappings that generalize a given permutation of blocks (finite arrays of fixed size) to a given partition of the lattice in blocks. We prove that any d-dimensional reversible cellular automaton can be expressed as the composit...
متن کاملAbout the Universality of the Billiard ball model
Block cellular automata (BCA) make local, parallel, synchronous and uniform updates of innnite lattices. In the one-dimensional case, there exist BCA with 11 states which are universal for computation. The Billiard ball model of Margolus is a reversible two-dimensional BCA which is able to simulate any two-register automaton and is thus universal. This simulation is achieved by embedding a logi...
متن کاملReversible space-time simulation of cellular automata
We brieey recall the deenitions of Cellular automata (ca), simulation, re-versibility and Partitioned cellular automata (pca) as deened by Morita. We call the sequence of the iterated conngurations of a connguration a space-time diagram. We deene an embedding relation between space-time diagrams and a space-time simulation relation between ca. We built a space-time simulation of any ca by a rev...
متن کامل